Composition Under Distributive Natural Transformations: Or, When Predicate Abstraction is Impossible
نویسندگان
چکیده
Abstract Natural language semanticists have often found it useful to assume that all expressions denote sets of values. The approach is most prominent in the study questions and prosodic focus, but also common work on indefinites, disjunction, negative polarity, scalar implicature. However, popular compositional implementation this idea known face technical obstacles presence object-language binding constructs, including, chiefly, lambda abstraction. problem has been well-described several occasions literature, fact solutions explored. This paper seeks formalize challenge defining an indeterminate semantics for operators, formally establish intuition insurmountable. primary benefit exercise offers abstract characterization what means lift operation from one semantic space another, a notion which may be applied domains having nothing do with alternatives.
منابع مشابه
Predicate Abstraction with Under-Approximation Refinement
We propose an abstraction-based model checking method which relies on refinement of an under-approximation of the feasible behaviors of the system under analysis. The method preserves errors to safety properties, since all analyzed behaviors are feasible by definition. The method does not require an abstract transition relation to be generated, but instead executes the concrete transitions whil...
متن کاملWhen quasistatic jamming is impossible
We propose a new condition to test for the impossibility of jamming in three-dimensional, quasistatic multi-rigid-body systems. Our condition can be written as a feasibility problem for a system of linear inequalities and therefore can be checked using linear programming techniques. To demonstrate the use of our jamming test, we apply it to a simple dexterous manipulation task and to the well-k...
متن کاملPredicate Abstraction
Designing basic protocols, used in networking, security and multiprocessor systems is hard. All of these have to deal with concurrency, that is the actions of multiple agents in parallel. This makes their design error-prone since all possible interactions between the various agents in the system have to be considered. In addition to concurrency, many of these protocols are designed to work with...
متن کاملExperimenting with Predicate Abstraction
Predicate abstraction is a technique employed in software model checking to produce abstract models that can be conservatively checked for property violations in reasonable time. The precision degree of different abstractions of the same program may differ based on (i) the set of predicates used; or (ii) the algorithmic technique employed to generate the model. In this paper we explain how we h...
متن کاملExperience with Predicate Abstraction
This reports some experiences with a recently-implemented prototype system for veriication using predicate abstraction, based on the method of Graf and Sa di 9]. Systems are described using a language of iterated guarded commands, called Mur ?? (since it is a simpliied version of our Mur protocol description language). The system makes use of two libraries: SVC 1] (an eecient decision procedure...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic, Language and Information
سال: 2022
ISSN: ['1572-9583', '0925-8531']
DOI: https://doi.org/10.1007/s10849-022-09361-2